Enumerating Rigid Sphere Packings
نویسنده
چکیده
Packing problems, which ask how to arrange a collection of objects in space to meet certain criteria, are important in a great many physical and biological systems, where geometrical arrangements at small scales control behavior at larger ones. In many systems there is no single, optimal packing that dominates, but rather one must understand the entire set of possible packings. As a step in this direction we enumerate rigid clusters of identical hard spheres for n ≤ 14 and clusters with the maximum number of contacts for n ≤ 19. A rigid cluster is one that cannot be continuously deformed while maintaining all contacts. This is a nonlinear notion that arises naturally because such clusters are the metastable states when the spheres interact with a short-range potential, as is the case in many nanoor microscale systems. We believe that our lists are nearly complete, except for a small number of highly singular clusters (linearly floppy but nonlinearly rigid). The data contains some major geometrical surprises, such as the prevalence of hypostatic clusters: those with less than the 3n − 6 contacts generically necessary for rigidity. We discuss these and several other unusual clusters whose geometries may give insight into physical mechanisms, pose mathematical and computational problems, or bring inspiration for designing new materials.
منابع مشابه
Enumerating Finite Sphere Packings
We consider packings of n identical spherical particles that bind to one another without deformation or overlap, and without any long range interactions. Combining graph theoretic enumeration with basic geometry, we analytically solve for packings of n ≤ 10 particles satisfying minimal rigidity constraints (≥ 3 contacts per particle and ≥ 3n− 6 total contacts). We find that the onset of packing...
متن کاملDeriving Finite Sphere Packings
Sphere packing problems have a rich history in both mathematics and physics; yet, relatively few analytical analyses of sphere packings exist, and answers to seemingly simple questions are unknown. Here, we present an analytical method for deriving all packings of n spheres in R3 satisfying minimal rigidity constraints (≥ 3 contacts per sphere and ≥ 3n− 6 total contacts). We derive such packing...
متن کاملDisks vs. Spheres: Contrasting Properties of Random Packings
Collections of random packings of rigid disks and spheres have been generated by computer using a previously described concurrent algorithm. Particles begin as infinitesimal moving points, grow in size at a uniform rate, undergo energynonconserving collisions, and eventually jam up. Periodic boundary conditions apply, and various numbers of particles have been considered (N~<2000 for disks, N~<...
متن کاملDensity Doubling, Double-circulants, and New Sphere Packings
New nonlattice sphere packings in dimensions 20, 22, and 44–47 that are denser than the best previously known sphere packings were recently discovered. We extend these results, showing that the density of many sphere packings in dimensions just below a power of 2 can be doubled using orthogonal binary codes. This produces new dense sphere packings in Rn for n = 25, 26, . . . , 31 and 55, 56, . ...
متن کاملPhase diagram and structural diversity of the densest binary sphere packings.
The densest binary sphere packings have historically been very difficult to determine. The only rigorously known packings in the α-x plane of sphere radius ratio α and relative concentration x are at the Kepler limit α=1, where packings are monodisperse. Utilizing an implementation of the Torquato-Jiao sphere-packing algorithm [S. Torquato and Y. Jiao, Phys. Rev. E 82, 061302 (2010)], we presen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM Review
دوره 58 شماره
صفحات -
تاریخ انتشار 2016